A Complete Axiomatization of Full Acyclic Join Dependencies

نویسنده

  • Francesco M. Malvestuto
چکیده

A sound and complete formal system for full acyclic join dependencies is obtained by adding three derivation rules to the axioms of multivalued dependencies. 0 1998 Elsevier Science B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Consistent Query Answers in the Presence of Universal Constraints

The framework of consistent query answers and repairs has been introduced to alleviate the impact of inconsistent data on the answers to a query. A repair is a minimally different consistent instance and an answer is consistent if it is present in every repair. In this article we study the complexity of consistent query answers and repair checking in the presence of universal constraints. We pr...

متن کامل

S ep 2 00 8 Consistent Query Answers in the Presence of Universal Constraints ⋆

The framework of consistent query answers and repairs has been introduced to alleviate the impact of inconsistent data on the answers to a query. A repair is a minimally different consistent instance and an answer is consistent if it is present in every repair. In this article we study the complexity of consistent query answers and repair checking in the presence of universal constraints. We pr...

متن کامل

Testing Implication of Probabilistic Dependencies

Axiomatization has been widely used for test­ ing logical implications. This paper suggests a non-axiomatic method, the chase, to test if a new dependency follows from a given set of probabilistic dependencies. Although the chase computation may require exponential time in some cases, this technique is a pow­ erful tool for establishing nontrivial theoreti­ cal results. More importantly, this a...

متن کامل

Interaction-Free Multivalued Dependency Sets

Multivalued dependencies (MVD) and join dependencies were introduced to study database design problems. Join dependencies can be divided into cyclic and acyclic join dependencies. A fundamental result in dependency theory is that a join Dependency is acyclic if and only if it is equivalent to a set of MVDs. In addition to this characterization it has been shown that such a set of MVDs has a cov...

متن کامل

A Formal Context for Acyclic Join Dependencies

Acyclic Join Dependencies (AJD) play a crucial role in database design and normalization. In this paper, we use Formal Concept Analysis (FCA) to characterize a set of AJDs that hold in a given dataset. This present work simplifies and generalizes the characterization of Multivalued Dependencies with FCA.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 68  شماره 

صفحات  -

تاریخ انتشار 1998